Mild and moderate mental illnesses can hinder labor force participation, lead to work interruptions, and hamper earning potential. Targeted interventions have proven effective at addressing these problems. But their potential depends on labor protections that enable people to take advantage of these interventions while keeping jobs and income.

Despite some improvements in access to evidence-based medications for opioid use disorder, treatment rates remain low at under a quarter of those with need. High costs for brand name products in these medication markets have limited the volume of drugs purchased, particularly through public health insurance and grant programs. Brand firm anti-competitive practices around the leading buprenorphine product Suboxone — including product hops, citizen petitions and Risk Evaluation and Mitigation Strategy abuses — helped to maintain high prices by extending brand (...) exclusivity periods and hindering generic drug entry. Remedies to address costly anti-competitive activities include adoption of the proposed CREATES Act and modernization of the Hatch-Waxman Act by the Congress, and implementation of substantive modifications to the Food and Drug Administration citizen petition filing procedures. Given the persistence of these abuses, prescriptive changes are favorable to the procedural and clarifying steps thus far favored by the federal government. Extrapolating from the 37% price declines attributable to generic entry for buprenorphine tablets in 2011, our calculations suggest that implementing these remedies to facilitate generic competition with Suboxone film would have resulted in savings of approximately $703 million overall and $203 million to Medicaid in 2017. (shrink)

A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x), f is a k(n)-enumerator if for every input x of length n, h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A. We determine exactly how hard it is to enumerate the Kolmogorov function, which (...) assigns to each string x its Kolmogorov complexity: • For every underlying universal machine U, there is a constant a such that C is k(n)-enumerable only if k(n) ≥ n/a for almost all n. • For any given constant k, the Kolmogorov function is k-enumerable relative to an oracle A if and only if A is at least as hard as the halting problem. • There exists an r.e., Turing-incomplete set A such for every non-decreasing and unbounded recursive function k, the Kolmogorov function is k(n)-enumerable relative to A. The last result is obtained by using a relativizable construction for a nonrecursive set A relative to which the prefix-free Kolmogorov complexity differs only by a constant from the unrelativized prefix-free Kolmogorov complexity. Although every 2-enumerator for C is Turing hard for K, we show that reductions must depend on the specific choice of the 2-enumerator and there is no bound on the quantity of their queries. We show our negative results even for strong 2-enumerators as an oracle where the querying machine for any x gets directly an explicit list of all hypotheses of the enumerator for this input. The limitations are very general and we show them for any recursively bounded function g: • For every Turing reduction M and every non-recursive set B, there is a strong 2-enumerator f for g such that M does not Turing reduce B to f. • For every non-recursive set B, there is a strong 2-enumerator f for g such that B is not wtt-reducible to f. Furthermore, we deal with the resource-bounded case and give characterizations for the class ${\rm S}_{2}^{{\rm P}}$ introduced by Canetti and independently Russell and Sundaram and the classes PSPACE, EXP. • ${\rm S}_{2}^{{\rm P}}$ is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time tt-reduction which reduces A to every strong 2-enumerator for g. • PSPACE is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time Turing reduction which reduces A to every strong 2-enumerator for g. Interestingly, g can be taken to be the Kolmogorov function for the conditional space bounded Kolmogorov complexity. • EXP is the class of all sets A for which there is a polynomially bounded function g and a machine M which witnesses A ∈ PSPACEf for all strong 2-enumerators f for g. Finally, we show that any strong O(log n)-enumerator for the conditional space bounded Kolmogorov function must be PSPACE-hard if P = NP. (shrink)

Throughout the biological and biomedical sciences there is a growing need for, prescriptive ‘minimum information’ (MI) checklists specifying the key information to include when reporting experimental results are beginning to find favor with experimentalists, analysts, publishers and funders alike. Such checklists aim to ensure that methods, data, analyses and results are described to a level sufficient to support the unambiguous interpretation, sophisticated search, reanalysis and experimental corroboration and reuse of data sets, facilitating the extraction of maximum value from data sets (...) them. However, such ‘minimum information’ MI checklists are usually developed independently by groups working within representatives of particular biologically- or technologically-delineated domains. Consequently, an overview of the full range of checklists can be difficult to establish without intensive searching, and even tracking thetheir individual evolution of single checklists may be a non-trivial exercise. Checklists are also inevitably partially redundant when measured one against another, and where they overlap is far from straightforward. Furthermore, conflicts in scope and arbitrary decisions on wording and sub-structuring make integration difficult. This presents inhibit their use in combination. Overall, these issues present significant difficulties for the users of checklists, especially those in areas such as systems biology, who routinely combine information from multiple biological domains and technology platforms. To address all of the above, we present MIBBI (Minimum Information for Biological and Biomedical Investigations); a web-based communal resource for such checklists, designed to act as a ‘one-stop shop’ for those exploring the range of extant checklist projects, and to foster collaborative, integrative development and ultimately promote gradual integration of checklists. (shrink)

Wittgenstein's genius, John Wisdom has suggested, was uniquely revealed in his ability to formulate such questions as ‘Could one play chess without the queen? Would it still be chess?’ The central questions raised by Richard Rorty's work may be cast in a parallel form: ‘Could one do philosophy without the notion of truth as “correspondence with the Real”? Would it still be philosophy?’ Both pairs of questions, Wittgenstein' and Rorty's, are quintessentially anti-essentialist. The scope and ingenuity of Rorty's ‘philosophy (...) without mirrors’ has challenged philosophers to reconf ront basic questions about the nature and purposes of philosophical inquiry. (shrink)

In this volume, fourteen scholars, many of them contemporaries of Professor Frank, engage with his legacy with important and seminal works which take some of ...

The present study seeks to lay out the most basic elements of the ontology of classical Aš‘arite theology. In several cases this requires a careful examination of the traditional and the formal lexicography of certain key expressions. The topics primarily treated are: how they understood “Being/ existence” and “being/existent” and essential natures; the systematic exploitation of the equivocities of certain expressions within a general context in which other than words there are no universals proves to be elegant as well as (...) insightful; the basic categories of primary entities: independant beings and nonindependant beings, created and uncreated, the equivocity of “being/existent” as predicated of contingent entities on the one hand and of God and His attributes on the other, and certain problems that arise because of the rigid application of the system's underlying analytic principles. Nous essayons ici de presenter les éléments fondamentaux de l'ontologie de l'aš‘arisme classique. Pour quelques expressions, il a fallu examiner la lexicographie et ordinaire et technique pour bien comprendre leur emploi et leur signification. Les sujets examinés sont: le sens de “Etre/existence” et de “être/existant” et le concept de réalité essentielle; l'emploi nuancé des équivocités de quelques expressions dans un contexte où les seuls universaux sont des mots, emploi qui se révèle philosophiquement élégant; les catégories fondamentales des êtres: êtres indépendants et êtres non-indépendants, soit créés soit incréés, l'équivocité de “être/existant” dit des êtres contingents d'une part, de Dieu et ses attributs d'autre part, et enfin quelques difficultiés qui résultent de l'application rigide des principes analytiques du système. (shrink)

This essay analyzes two contrasting conceptions of ethics set forth in Muslim fundamental theology (kalām), namely, those of the Mu'tazilites and the Ash'arites of the fourth and fifth centuries a.h. (tenth and eleventh centuries c.e.). After set- ting forth a brief statement on the already well-studied position of the Mu'tazi- lites on human actions, the author devotes the rest of this essay to the less-studied position on human actions of the Ash'arites. Of special interest is his analysis of God's creation (...) (khalq) of actions and man's performance (kasb) of them. (shrink)

Our intention here is to present the essential character of classical, sunnm within a strictly formal perspective and to set out its basic aspects. It was conceived by the mutakallimm differed in a number of basic concepts and constructs and in its analytic system, the topical organisation of the major compendia parallels that of metaphysics as understood in the contemporary Aristotelian tradition. The debates between kalm, however, is theological in the strict sense of the term and it is as such (...) that its problematic and its procedures are primarily to be understood. Thus seen, the object of kalām is to rationalise the cognitive content presented to Believers in the symbolic language of the koranic revelation. It has, then, four principal tasks, sc, to conceptualise, to order, to explain, and where possible to justify the primary doctrines of the community whose belief is held to be normative. Within this framework the differences that characterise the major schools as such and the various tendencies of individual masters within each school may readily be brought to light. (shrink)

INTRODUCTION By way of introduction I wish to indicate briefly something of the scope and aim of this study and to make a few remarks on the perspective ...

v. 1. Philosophy, theology and mysticism in medieval Islam -- v. 2. Early Islamic theology : the Muʻtazilites and al-Ashʻarī -- v. 3. Classical Islamic theology : the Ashʻarites.

This report on research in progress lists ratings of journals useful for business & society scholars for publishing. Ratings by an expert panel of such scholars are presented. Included are journals focused largely on this and closely related fields, and also those that reach a wider audience involved with management studies.